Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- Збир на елементи во бинарно дрво Problem 3 (0 / 0)
- Дадено ви е бинарно дрво. Потоа дадена ви е вредноста на некој јазол во дрвото. Испечатете го збирот на елементите во неговото лево поддрво кои се помали од него и збирот на елементите во неговото десно поддрво кои се поголеми од него.
- Име на класата (Java): BinaryTreeSum.
- import java.io.BufferedReader;
- import java.io.InputStreamReader;
- import java.util.StringTokenizer;
- class BNode<E> {
- public E info;
- public BNode<E> left;
- public BNode<E> right;
- static int LEFT = 1;
- static int RIGHT = 2;
- public BNode(E info) {
- this.info = info;
- left = null;
- right = null;
- }
- public BNode() {
- this.info = null;
- left = null;
- right = null;
- }
- public BNode(E info, BNode<E> left, BNode<E> right) {
- this.info = info;
- this.left = left;
- this.right = right;
- }
- }
- class BTree<E extends Comparable<E>> {
- public BNode<E> root;
- public BTree() {
- root = null;
- }
- public BTree(E info) {
- root = new BNode<E>(info);
- }
- public void makeRoot(E elem) {
- root = new BNode(elem);
- }
- public void makeRootNode(BNode<E> node) {
- root = node;
- }
- public BNode<E> addChild(BNode<E> node, int where, E elem) {
- BNode<E> tmp = new BNode<E>(elem);
- if (where == BNode.LEFT) {
- if (node.left != null) // veke postoi element
- return null;
- node.left = tmp;
- } else {
- if (node.right != null) // veke postoi element
- return null;
- node.right = tmp;
- }
- return tmp;
- }
- public BNode<E> addChildNode(BNode<E> node, int where, BNode<E> tmp) {
- if (where == BNode.LEFT) {
- if (node.left != null) // veke postoi element
- return null;
- node.left = tmp;
- } else {
- if (node.right != null) // veke postoi element
- return null;
- node.right = tmp;
- }
- return tmp;
- }
- public BNode<E> find(BNode<E> temp,E elem) {
- BNode<E> result = null;
- if (temp == null)
- return null;
- if (temp.info.equals(elem))
- return temp;
- if (temp.left != null)
- result = find(temp.left,elem);
- if (result == null)
- result = find(temp.right,elem);
- return result;
- }
- public int sumLeft (BNode<Integer> node, BNode<Integer> root) {
- if (node == null)
- return 0;
- else {
- if (node.info < root.info){
- return sumLeft(node.left, root) + sumLeft(node.right, root) + node.info;
- }
- return sumLeft(node.left, root) + sumLeft(node.right, root);
- }
- }
- public int sumRight(BNode<Integer> node, BNode<Integer> root){
- if(node == null)
- return 0;
- else {
- if(node.info > root.info){
- return sumRight(node.left,root) + sumRight(node.right,root) + node.info;
- }
- return sumRight(node.left,root) + sumRight(node.right,root);
- }
- }
- }
- public class BinaryTreeSum {
- public static void main(String[] args) throws Exception {
- int i, j, k;
- int index;
- String action;
- String line;
- BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
- StringTokenizer st;
- int N = Integer.parseInt(br.readLine());
- BNode<Integer> nodes[] = new BNode[N];
- BTree<Integer> tree = new BTree<Integer>();
- for (i=0;i<N;i++)
- nodes[i] = new BNode<Integer>();
- for (i = 0; i < N; i++) {
- line = br.readLine();
- st = new StringTokenizer(line);
- index = Integer.parseInt(st.nextToken());
- nodes[index].info = Integer.parseInt(st.nextToken());
- action = st.nextToken();
- if (action.equals("LEFT")) {
- tree.addChildNode(nodes[Integer.parseInt(st.nextToken())], BNode.LEFT, nodes[index]);
- } else if (action.equals("RIGHT")) {
- tree.addChildNode(nodes[Integer.parseInt(st.nextToken())], BNode.RIGHT, nodes[index]);
- } else {
- // this node is the root
- tree.makeRootNode(nodes[index]);
- }
- }
- int baranaVrednost=Integer.parseInt(br.readLine());
- br.close();
- // vasiot kod ovde
- BNode<Integer> temp = tree.find(tree.root,baranaVrednost);
- System.out.print(tree.sumLeft(temp.left,temp) + " ");
- System.out.print(tree.sumRight(temp.right, temp));
- }
- }
- Sample input
- 10
- 0 10 ROOT
- 1 19 LEFT 0
- 2 8 LEFT 1
- 3 7 LEFT 2
- 4 60 RIGHT 2
- 5 5 RIGHT 1
- 6 4 RIGHT 0
- 7 13 RIGHT 6
- 8 2 LEFT 7
- 9 1 RIGHT 7
- 10
- Sample output
- 20 13
Add Comment
Please, Sign In to add comment