// ====================================================================
// RECURSIVE ROUND ROBIN (RRR) TREE LEAF TRAVERSAL ALGORITHM (JS ES6+)
// METHOD: Cagil Seker (MadChuckle) - cagils@gmail.com
// SAMPLE ALGORITHM: Apass.Jack (https://cs.stackexchange.com/users/91753/apass-jack)
// ====================================================================
// This is a gist for my (MadChuckle) question at StackOverflow
// Link: 'https://cs.stackexchange.com/questions/95951/is-there-a-name-and-efficient-algorithm-for-this-tree-traversal-method'
//
// This is based on the the pseudo code (and later an implementation) from Apass.Jack
//
// *****************************************************************************
// * A RRR-TL Traversal is an hierarchical algorithm that gives each sub-tree *
// * equal priority among its siblings with respect to its parent recursively *
// * Refer to the linked SO question above for more information. *
// *****************************************************************************
let opPush = 0
let opUnshift = 0
let opSplice = 0
let opAccess = 0
let opRecursiveCall = 0
let opZipCall = 0
let maxDepth = 0
let myTree = [[['A', 'B', ['C']], ['E']], 'D', ['F', [['G', 'H'], [['I', 'J']], 'K']]]
let result = rrrTraversal(myTree)
let leafCount = result.length
console.log(JSON.stringify(result))
console.log('\n')
console.log('Max Depth: ' + maxDepth)
console.log('Leaf Count: ' + leafCount)
console.log('Push: ' + opPush)
console.log('Unshift: ' + opUnshift)
console.log('Splice: ' + opSplice)
console.log('Access: ' + opAccess)
console.log('Recursive Call: ' + opRecursiveCall)
console.log('Zip Call: ' + opZipCall)
// procedure rrrTraversal(rootedTree):
function rrrTraversal(t, depth = 0) {
opRecursiveCall++
if(maxDepth < depth) {
maxDepth = depth
}
//let str_t = JSON.stringify(t)
//console.log(`\nDEPTH: ${depth}`)
//console.log(`t = ${str_t}`)
if (!Array.isArray(t)) {
return [t]
}
// Merge a parent with its child as a minor performance improvement.
if (t.length == 1) {
return rrrTraversal(t[0], depth + 1)
}
let ll = [] // ll := an empty list of lists
// foreach subtree s of rootedTree from left to right:
t.forEach (s => {
let ss = rrrTraversal(s, depth + 1)
opPush++
ll.push(ss) //push ss to the back of ll
})
//let str_ll = JSON.stringify(ll)
let z = zip(ll)
//let str_z = JSON.stringify(z)
//console.log(`zip(${str_ll}) = ${str_z}`)
//console.log(`END OF DEPTH: ${depth}\n`)
return z
}
// procedure zip(listOflists):
function zip(ll) {
opZipCall++
//let str_ll = JSON.stringify(ll)
//console.log(`--- ZIP ---`)
//console.log(`with ll = ${str_ll}`)
let zipped = []
// while listOflists is not empty:
while (ll.length) {
let toRemove = [] // indices to be removed
// foreach list li in listOflists from front to end:
for (let i = 0; i < ll.length; i++) {
opAccess++
let li = ll[i]
if (!li.length) { // if li is empty:
opUnshift++
toRemove.unshift(i) // add index to the beginning of toRemove
} else {
opSplice++
let fi = li.splice(0, 1)[0] // remove the first item from li and hold it
opPush++
zipped.push(fi) // push that first item to the back of the zipped
}
}
//let str_ll2 = JSON.stringify(ll)
//let str_zipped = JSON.stringify(zipped)
//let str_toRemove = JSON.stringify(toRemove)
//console.log(`\tzipped = ${str_zipped}`)
//console.log(`\ttoRemove = ${str_toRemove}`)
//console.log(`\tll2 = ${str_ll2}`)
opSplice += toRemove.length
toRemove.forEach(index => ll.splice(index, 1))
}
return zipped
}
function alternativeZip(ll) {
let longest = Math.max(...ll.map(e => e.length))
let i = 0
let zipped = []
while(i < longest) {
let z = ll.reduce( (total, value) => {
if(value.length > i) {
let e = value[i]
total.push(e)
}
return total
}
, [])
zipped.push(z)
i++
}
console.log(`zipped:` + JSON.stringify(zipped))
return zipped.filter(Boolean)
}
About Online Node Compiler
Try our Online Node Compiler (Version Node v6.11.2) to Edit, Run, and Share your Node Code directly from your browser. This online development environment provides you the latest version Node v6.11.2.
How to use Online Node Compiler?
Write and Execute Code
- Write your program (or, paste it) directly under the "Source Code" tab.
- If you want to save your program, go to the "Project" menu and save it.
- You can directly execute your program without saving it by clicking on on "Execute" button.
User Input
The latest version of Coding Ground allows to provide program input at run time from the termnial window exactly the same way as you run your program at your own computer. So simply run a program and provide your program input (if any) from the terminal window available in the right side.
Online Node Compiler: Keyboard Shortcuts
The following are the keyword shortcut of this Online Node Compiler:
Shortcut | Description |
⌘ + Enter | Run the program |
⌘ + S | Save Project (Login Required) |
⇧ + ⌘ + S | Save As Project |
⌘ + P | New Project |
⌘ + G | Share Project |
⌘ + Z | Undo Editing |
⌘ + Y | Redo Editing |
⌘ + A | Select All Text |
⌘ + X | Cut Selected Text |
⌘ + C | Copy Selected Text |
⌘ + V | Paste Copied Text |
⌘ + F | Search Text |
⌘ + ⌥ + F | Replace Text |
Shortcut | Description |
Ctrl + Enter | Run the program |
Ctrl + S | Save Project |
Shift + Ctrl + S | Save As Project |
Ctrl + G | Share Project |
Ctrl + Z | Undo Editing |
Ctrl + Y | Redo Editing |
Ctrl + A | Select All Text |
Ctrl + X | Cut Selected Text |
Ctrl + C | Copy Selected Text |
Ctrl + V | Paste Copied Text |
Ctrl + F | Search Text |
Ctrl + H | Replace Text |
Online Node Compiler: Save and Share Node Code (Project)
Save Node Project Online
You can save your Node Project with us so that you can access this project later on. To save a project you will need to create a login Id with us. So before you save a project, please create a login Id using a link given at the top right corner of this page.
Share Node Project Online
You can use this feature to share your Node Code with your teachers, classmates and colleagues. Just click Share Button and it will create a short link, which can be shared through Email, WhatsApp or even through Social Media. A shared link will be deleted if it has been passive for almost 3 months.
More Features of Online Node Compiler
- Theme – You can change the current editor's theme from the "Editor Theme" option under "Settings" menu.
- Font Size – You can change the font size of the editor /compiler from from the "Font Size" option under "Settings" menu.
- Tab Size – You can change the tab size from the "Tab Size" option under "Settings" Menu.
- Show/Hide Line Numbers – You can show/hide the line number with the code from the "Show Line Numbers" or "Hide Line Numbers" option under "Settings" Menu.
- And, many more.
Benefits of Using Online Node Compiler
There are several benefits of using the Online Node Compiler to run your Node code:
- Platform independence: You can run your code from any device without taking care of operating systems.
- Convenience: You don't need to install anything for using this.
- No setup required: There is no need for additional setup to run your code.
- Updated version: Our online compiler/editors/terminals are the latest up-to-date.