Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /*
- Инвертировать бинарное дерево
- */
- var inTree = {
- left: {
- v: 4,
- left: {
- v: 1,
- left: null,
- right: null
- },
- right: {
- v: 3,
- left: null,
- right: null
- },
- v: 2
- },
- right: {
- left: {
- v: 6,
- left: null,
- right: null
- },
- right: {
- v: 9,
- left: null,
- right: null
- },
- v: 7
- },
- v: 4
- }
- function invertTree (node) {
- if (node == null) return null;
- let q = [node];
- while(q.length > 0) {
- let cur = q.shift();
- let tmp = cur.left;
- cur.left = cur.right;
- cur.right = tmp;
- if (cur.left !== null) q.push(cur.left)
- if (cur.right !== null) q.push(cur.right)
- }
- return node
- }
- console.log(invertTree(inTree));
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement