Skip to content
#

circleci

Here are 2,596 public repositories matching this topic...

Given a rooted tree of N nodes, where each node is uniquely numbered in between [1..N]. The node 1 is the root of the tree. Each node has an integer value which is initially 0.You need to perform the following two kinds of queries on the tree: add t value: Add value to all nodes in subtree rooted at t max a b: Report maximum value on the path fr…

  • Updated Jan 18, 2017
  • Java

Improve this page

Add a description, image, and links to the circleci topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the circleci topic, visit your repo's landing page and select "manage topics."

Learn more