We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
- Prepare
- Data Structures
- Trees
- Swap Nodes [Algo]
- Discussions
Swap Nodes [Algo]
Swap Nodes [Algo]
Sort by
recency
|
699 Discussions
|
Please Login in order to post a comment
Java Solution
from collections import deque
class Node: def init(self, val): self.val = val self.left = None self.right = None
def createNode(indexes): if not indexes: return None
def swapNodes(root, queries): if not root or not queries: return []
def inOrderTraversal(root): if not root: return []
def swapNodesAndTraverse(indexes, queries): root = createNode(indexes) swapNodes(root, queries) return inOrderTraversal(root)
Python 3:
js
Simple Go (Golang) solution