Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.io.BufferedReader;
- import java.io.InputStreamReader;
- import java.util.StringTokenizer;
- class BNode<E> {
- static int LEFT = 1;
- static int RIGHT = 2;
- public E info;
- public BNode<E> left;
- public BNode<E> right;
- 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<Integer> search(BNode<Integer> jazol, int el) {
- BNode<Integer> res = null;
- /*
- if(jazol.left != null)
- res = search(jazol.left, el);
- if(jazol.info == el)
- return jazol;
- if(jazol == null & jazol.right != null)
- res = search(jazol.right, el);
- */
- if (jazol == null)
- return null;
- if (jazol.info == el)
- return jazol;
- if (jazol.left != null)
- res = search(jazol.left, el);
- if (res == null)
- res = search(jazol.right, el);
- return res;
- }
- int zbirLevo(BNode<Integer> jazol, int el) // pomali od nego
- {
- int s = 0;
- if (jazol == null)
- return 0;
- if (jazol.info < el)
- s += jazol.info;
- if (jazol.left != null)
- s += zbirLevo(jazol.left, el);
- if (jazol.right != null)
- s += zbirLevo(jazol.right, el);
- return s;
- }
- int zbirDesno(BNode<Integer> jazol, int el) // pogolemi od nego
- {
- int s = 0;
- if (jazol == null)
- return 0;
- if (jazol.info > el)
- s += jazol.info;
- if (jazol.left != null)
- s += zbirDesno(jazol.left, el);
- if (jazol.right != null)
- s += zbirDesno(jazol.right, el);
- return s;
- }
- }
- 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> jazol = tree.search(tree.root, baranaVrednost);
- System.out.println(tree.zbirLevo(jazol.left, jazol.info) + " " + tree.zbirDesno(jazol.right, jazol.info));
- }
- }
Add Comment
Please, Sign In to add comment